Pricing-based primal and dual bounds for selected packing problems
نویسندگان
چکیده
منابع مشابه
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit function as well as the exact packing constraints are not fully known in advance. In each round a...
متن کاملConvergent Lower Bounds for Packing Problems via Restricted Dual Polytopes
Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have been proposed for them. The most famous is from Gilmore and Gomory [5] and relies on a column generation scheme. Column generation methods are known to have convergence issues, and (when minimizing) no useful...
متن کاملPrimal-dual Circle packing of Planar Maps
This work is based on Mohar [1]’s recent algorithm for circle packing for the Euclean case. We implement his polynomial time algorithm for constructing primal-dual circle packings of almost 3-connected planar maps. We have improved Mohar’s algorithm and have been able to get near an order of magnitude speed up for large graphs. We describe our implementation in C/C++ style pseudo-code.
متن کاملOnline Primal-Dual Algorithms for Covering and Packing
We study a wide range of online covering and packing optimization problems. In an online covering problem, a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one, in rounds. In an online packing problem, the profit function as well as the packing constraints are not known in advance. In each round additional informatio...
متن کاملPrimal-Dual Formulations for Parameter Estimation Problems
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2020
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-020-00451-0